#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct Stu
{
    int id;
    int C, M, E, A;
};
bool CCmp(const Stu &s1, const Stu &s2)
{
    return s1.C > s2.C;
}
bool MCmp(const Stu &s1, const Stu &s2)
{
    return s1.M > s2.M;
}
bool ECmp(const Stu &s1, const Stu &s2)
{
    return s1.E > s2.E;
}
bool ACmp(const Stu &s1, const Stu &s2)
{
    return s1.A > s2.A;
}
int main()
{
    string na = "N/A";
    char names[] = {'A', 'C', 'M', 'E'};
    int m, n, i;
    int a[2500];
    vector<Stu> stus;
    vector<Stu> CRank;
    vector<Stu> MRank;
    vector<Stu> ERank;
    vector<Stu> ARank;
    cin >> n >> m;
    Stu *s;
    for (i = 0; i < n; i++)
    {
        s = new Stu();
        cin >> s->id >> s->C >> s->M >> s->E;
        s->A = s->C + s->M + s->E;
        stus.push_back(*s);
    }
    Stu head = {200, 200, 200, 200, 400};
    stus.insert(stus.begin(), head);
    if (n == 0 || m == 0)
    {
        cout << na;
        return 0;
    }
    sort(stus.begin(), stus.end(), CCmp);
    CRank.assign(stus.begin(), stus.end());
    sort(stus.begin(), stus.end(), MCmp);
    MRank.assign(stus.begin(), stus.end());
    sort(stus.begin(), stus.end(), ECmp);
    ERank.assign(stus.begin(), stus.end());
    sort(stus.begin(), stus.end(), ACmp);
    ARank.assign(stus.begin(), stus.end());
    int size = stus.size(), min;
    int id;
    int num[4];
    char name;
    for (int j = 0; j < m; j++)
    {
        cin >> id;
        min = 3000;
        for (i = 0; i < 4; i++)
        {
            num[i] = 0;
        }
        //如果相等则排名不变，如果和之前的不等，则排名为当前i
        // 97 95 95 90 
        // 1  2  2  4
        for (i = 1; i < size; i++)
        {
            if (ARank[i].A != ARank[i - 1].A)
                num[0] = i;
            if (ARank[i].id == id)
            {
                break;
            }
        }
        if (i == size)
        {
            cout << na << endl;
            continue;
        }
        for (i = 1; i < size; i++)
        {
            if (CRank[i].C != CRank[i - 1].C)
                num[1] = i;
            if (CRank[i].id == id)
            {
                break;
            }
        }
        for (i = 1; i < size; i++)
        {
            if (MRank[i].M != MRank[i - 1].M)
                num[2] = i;
            if (MRank[i].id == id)
            {
                break;
            }
        }
        for (i = 1; i < size; i++)
        {
            if (ERank[i].E != ERank[i - 1].E)
                num[3] = i;
            if (ERank[i].id == id)
            {
                break;
            }
        }
        for (i = 0; i < 4; i++)
        {
            if (min > num[i])
            {
                min = num[i];
                name = names[i];
            }
        }
        cout << min << ' ' << name << endl;
    }
    return 0;
}